Dynamic Allocation Problems in Continuous Time
نویسندگان
چکیده
منابع مشابه
On Dynamic Principal-Agent Problems in Continuous Time
I study the provision of incentives in dynamic moral hazard models with hidden actions and possibly hidden states. I characterize implementable contracts by establishing the applicability of the first-order approach to contracting. Implementable contracts are history dependent, but can be written recursively with a small number of state variables. When the agent’s actions are hidden, but all st...
متن کاملDevelopment of a Genetic Algorithm for Advertising Time Allocation Problems
Commercial advertising is the main source of income for TV channels and allocation of advertising time slots for maximizing broadcasting revenues is the major problem faced by TV channel planners. In this paper, the problem of scheduling advertisements on prime-time of a TV channel is considered. The problem is formulated as a multi-unit combinatorial auction based mathematical model. This is a...
متن کاملPseudoconvex Multiobjective Continuous-time Problems and Vector Variational Inequalities
In this paper, the concept of pseudoconvexity and quasiconvexity for continuous~-time functions are studied and an equivalence condition for pseudoconvexity is obtained. Moreover, under pseudoconvexity assumptions, some relationships between Minty and Stampacchia vector variational inequalities and continuous-time programming problems are presented. Finally, some characterizations of the soluti...
متن کاملEvaluating the importance of dynamic allocation and routing of rescuers in reducing response time
Due to delay in receiving emergency medical services, a high number of injured people and patients annually lose their lives. Determining the medical service area and correct routing of rescuing operation is influential on the reduction of rescuers’ response time. Changing the traffic flow leads to change of medical service area. Therefore, it is expected that by observing changing traffic, the...
متن کاملRecovery Time of Dynamic Allocation
Many distributed protocols arising in applications in on-line load balancing and dynamic resource allocation can be modeled by dynamic allocation processes related to the \balls into bin" problems. Traditionally the main focus of the research on dynamic allocation processes is on verifying whether a given process is stable, and if so, on analyzing its behavior in the limit (i.e., after suucient...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 1994
ISSN: 1050-5164
DOI: 10.1214/aoap/1177005062